Super Edge-Magic Models
نویسندگان
چکیده
In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.
منابع مشابه
Further Results on Complementary Super Edge Magic Graph Labeling
Abstract : In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary super edge magic if there exist a bijection f:V U E → { 1, 2, ............p+q } such that p+q+1 f(x) is constant. Such a labeling is called complementary super edge magic labeling with complementary s...
متن کاملBounds on the size of super edge-magic graphs depending on the girth
Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q ≤ 2p− 3. Furthermore, if G is super edge-magic and q = 2p− 3, then the girth of G is 3. It is also known that if the girth of G is at least 4 and G is super edge-magic then q ≤ 2p − 5. In this paper we show that there are infinitely many graphs which are super edge-magic, have girth 5, and q =...
متن کاملThe place of super edge-magic labelings among other classes of labelings
A (p; q)-graph G is edge-magic if there exists a bijective function f :V (G)∪E(G)→{1; 2; : : : ; p + q} such that f(u) + f(v) + f(uv)= k is a constant, called the valence of f, for any edge uv of G. Moreover, G is said to be super edge-magic if f(V (G))= {1; 2; : : : ; p}. In this paper, we present some necessary conditions for a graph to be super edge-magic. By means of these, we study the sup...
متن کاملOn Super Edge-magic Total Labeling of Reflexive W-trees
ON SUPER EDGE-MAGIC TOTAL LABELING OF REFLEXIVE W-TREES Muhammad Imran, Mehar Ali Malik, M. Yasir Hayat Malik Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Islamabad, Pakistan. E-mail: {imrandhab, alies.camp, yasirmalikawan}@gmail.com Mathematics Subject Classification: 05C78 ABSTRACT. Kotzig and Rosa [17] defined a magic lab...
متن کاملOn the Super Edge-Magic Deficiency of Graphs
A (p,q) graph G is called super edge-magic if there exists a bijective function f from V (G) ∪ E(G) to {1, 2,. .. , p + q} such that f (x) + f (xy) + f (y) is a constant k for every edge xy of G and f (V (G)) = {1, 2,. .. , p}. Furthermore, the super edge-magic deficiency of a graph G is either the minimum nonnegative integer n such that G ∪ nK 1 is super edge-magic or +∞ if there exists no suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 5 شماره
صفحات -
تاریخ انتشار 2011